منابع مشابه
Dimension 1 sequences are close to randoms
We show that a sequence has effective Hausdorff dimension 1 if and only if it is coarsely similar to a Martin-Löf random sequence. More generally, a sequence has effective dimension s if and only if it is coarsely similar to a weakly s-random sequence. Further, for any s ă t, every sequence of effective dimension s can be changed on density at most H ́1ptq ́H ́1psq of its bits to produce a sequen...
متن کاملNative protein sequences are close to optimal for their structures.
How large is the volume of sequence space that is compatible with a given protein structure? Starting from random sequences, low free energy sequences were generated for 108 protein backbone structures by using a Monte Carlo optimization procedure and a free energy function based primarily on Lennard-Jones packing interactions and the Lazaridis-Karplus implicit solvation model. Remarkably, in t...
متن کاملSequences close to periodic
The paper is a survey of notions and results related to classical and new generalizations of the notion of a periodic sequence. The topics related to almost periodicity in combinatorics on words, symbolic dynamics, expressibility in logical theories, algorithmic computability, Kolmogorov complexity, number theory, are discussed.
متن کاملSolving the Mystery of Dengue in Iran; Are We Close to an Answer?
Dengue fever is a mosquito-borne infection which is endemic in Southeast Asia. Although it has not been distributed in Iran, locating near other countries where the Dengue has been revealed is a threat for Iran because different connection between countries may increase the rate of infection.
متن کاملLimits to Joining with Generics and Randoms
Posner and Robinson [4] proved that if S ⊆ ω is non-computable, then there exists a G ⊆ ω such that S ⊕ G ≥T G′. Shore and Slaman [7] extended this result to all n ∈ ω, by showing that if S T ∅(n−1) then there exists a G such that S ⊕ G ≥T G(n). Their argument employs KumabeSlaman forcing, and so the set they obtain, unlike that of the Posner-Robinson theorem, is not generic for Cohen forcing i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.09.031